Gapsplit: efficient random sampling for non-convex constraint-based models
نویسندگان
چکیده
منابع مشابه
Models for random Constraint
We introduce a class of models for random Constraint Satisfaction Problems. This class includes and generalizes many previously studied models. We characterize those models from our class which are asymptot-ically interesting in the sense that the limiting probability of satissability changes signiicantly as the number of constraints increases. We also discuss models which exhibit a sharp thres...
متن کاملRandom Sampling Based Algorithms for Efficient Semi-Key Discovery
We design efficient random sampling based algorithms for discovering keys and semi-keys in large tables. Given that these problems are provably hard, we adopt the approach of finding approximate solutions to save on time and space requirements. We first propose two natural measures for quantifying the approximation of a semi-key. For the problem of finding minimum keys, we develop efficient alg...
متن کاملConvex Random Graph Models
We propose a principled framework for designing random graph models from minimal assumptions. Our central principle is to study the uniform measure over symmetric subsets of graphs. The symmetries we require are far less limiting than those in existing graph models and flexible enough to encompass both geometric features and properties of graph limits. Our main contribution is to derive natural...
متن کاملEfficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallelism and external memory. In contrast to previously known work for parallel setups, our method is able to fulfill the three criteria of uniformity, work-optimality and balance among the processors simultaneously. To gua...
متن کاملModels for Random Constraint Satisfaction Problems
We introduce a class of models for random Constraint Satisfaction Problems This class includes and generalizes many previously studied models We characterize those models from our class which are asymptot ically interesting in the sense that the limiting probability of satis ability changes signi cantly as the number of constraints increases We also dis cuss models which exhibit a sharp thresho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2020
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btz971